Block Matrix Representation of a Graph Manifold Linking Matrix Using Continued Fractions
نویسندگان
چکیده
منابع مشابه
A Geometric Representation of Continued Fractions
Inspired by work of Ford, we describe a geometric representation of real and complex continued fractions by chains of horocycles and horospheres in hyperbolic space. We explore this representation using the isometric action of the group of Möbius transformations on hyperbolic space, and prove a classical theorem on continued fractions.
متن کاملMatrix Continued Fractions Related to First-order Linear Recurrence Systems∗
We introduce a matrix continued fraction associated with the first-order linear recurrence system Yk = θkYk−1. A Pincherle type convergence theorem is proved. We show that the n-th order linear recurrence relation and previous generalizations of ordinary continued fractions form a special case. We give an application for the numerical computation of a non-dominant solution and discuss special c...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملInverse of the distance matrix of a block graph
Graham et al. [3] proved a very attractive theorem about the determinant of the distance matrix DG of a connected graph G as a function of the distance matrix of its 2-connected blocks. In a connected graph, the distance between two vertices d(u, v) is the length of the shortest path between them. Let A be an n n matrix. Recall that for 1 i, j n, the cofactor ci,j is defined as ( 1) iþj times t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2014
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2014.513183